Equational Reasoning for Linking with First-Class Primitive Modules
نویسندگان
چکیده
Modules and linking are usually formalized by encodings which use the-calculus, records (possibly dependent), and possibly some construct for recursion. In contrast, we introduce the m-calculus, a calculus where the primitive constructs are modules, linking, and the selection and hiding of module components. The m-calculus supports smooth encodings of software structuring tools such as functions (calculus), records, objects (&-calculus), and mutually recursive deeni-tions. The m-calculus can also express widely varying kinds of module systems as used in languages like C, Haskell, and ML. We prove the m-calculus is connuent, thereby showing that equational reasoning via the m-calculus is sensible and well behaved.
منابع مشابه
FUZZY EQUATIONAL CLASSES ARE FUZZY VARIETIES
In the framework of fuzzy algebras with fuzzy equalities and acomplete lattice as a structure of membership values, we investigate fuzzyequational classes. They consist of special fuzzy algebras fullling the samefuzzy identities, dened with respect to fuzzy equalities. We introduce basicnotions and the corresponding operators of universal algebra: construction offuzzy subalgebras, homomorphisms...
متن کاملAlgebraic Terminological Representation
This thesis investigates terminological representation languages, as used in kl-one-type knowledge representation systems, from an algebraic point of view. Terminological representation languages are based on two primitive syntactic types, called concepts and roles, which are usually interpreted model-theoretically as sets and relations, respectively. I propose an algebraic rather than a model-...
متن کاملMixin Modules and Computational Effects
We define a calculus for investigating the interactions between mixin modules and computational effects, by combining the purely functional mixin calculus CMS with a monadic metalanguage supporting the two separate notions of simplification (local rewrite rules) and computation (global evaluation able to modify the store). This distinction is important for smoothly integrating the CMS rules (wh...
متن کاملSituated Adaptive Software: beyond the Object Paradigm
This paper reviews our progress towards a new software paradigm extending the object paradigm, based on hidden order sorted algebra. Our goal is to produce software that is much more adaptable to context, and is also highly reliable and predictable. We nd the logic of algebra, which is equational logic, especially convenient because of its simple and eecient mech-anisation of reasoning. We show...
متن کاملF-quasigroups and Generalized Modules
In [3], we showed that every F-quasigroup is linear over a special kind of Moufang loop called an NK-loop. Here we extend this relationship by showing an equivalence between the equational class of (pointed) F-quasigroups and the equational class corresponding to a certain notion of generalized module (with noncommutative, nonassociative addition) for an associative ring.
متن کامل